Linearity and Bisimulation
نویسندگان
چکیده
Exploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-calculus in which we abstract away not only τ -actions but also non-τ actions which do not affect well-typed observers. This gives a congruence far larger than the standard bisimilarity while retaining semantic soundness. The framework is smoothly extendible to other settings involving nondeterminism and state. As an application we develop a behavioural theory of secrecy in the π-calculus which ensures secure information flow for a strictly greater set of processes than the type-based approach in [20, 23], while still offering compositional verification techniques.
منابع مشابه
Distribution-Based Bisimulation for Labelled Markov Processes
In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based bisimulations, our distribution bisimulation is weaker, but corresponds more closely to linear properties. We construct a logic and a metric to describe our distribu...
متن کاملLinearity and nonlinearity in distributed computation
The copying of processes is limited in the context of distributed computation, either as a fact of life, often because remote networks are simply too complicated to have control over, or deliberately, as in the design of security protocols. Roughly, linearity is about how to manage without a presumed ability to copy. The meaning and mathematical consequences of linearity are studied for path-ba...
متن کاملLinearity in Process Languages
The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provi...
متن کاملBisimulation for BL-general fuzzy automata
In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...
متن کاملApplicative Bisimulation and Quantum $\lambda$-Calculi (Long Version)
Applicative bisimulation is a coinductive technique to check program equivalence in higherorder functional languages. It is known to be sound— and sometimes complete — with respect to context equivalence. In this paper we show that applicative bisimulation also works when the underlying language of programs takes the form of a linear λ-calculus extended with features such as probabilistic binar...
متن کاملOn Bisimulation Theory in Linear Higher-Order π-Calculus
Higher-order process calculi have been receiving much attention in recent years for its significance in both theorey and practice. Work on bisimulations has never ceased evolving, typically represented by Thomsen and Sangiorgi for their work on bisimulation theory and encoding to and from first-order process calculi. Fu puts forth linear higher-order π-calculus, and makes improvement to previou...
متن کامل